package sort;

import binarysearch.search;
import count.Count_Words;
import hashbush.hashbush;

import java.util.Arrays;
import java.util.Map;
import java.util.Set;

public class Test {
    public static void main(String[] args) {
        Count_Words count_words=new Count_Words();
        String[] arrays={"abc","dawd","sdaw","hello","hello","world"};
        Map<String,Integer> map=count_words.Count_Words(arrays);
        Set<Map.Entry<String,Integer>> entrySet= map.entrySet();
        for(Map.Entry<String,Integer> entry : entrySet){
            System.out.println("key: " + entry.getKey() + " val: " + entry.getValue());
        }
    }
    public static void main3(String[] args) {
        hashbush hashbush=new hashbush();
        hashbush.push(10,50);
        System.out.println(hashbush.get(10));
    }

    public static void main2(String[] args) {
          search search =new search();
          search.insert(10);
          search.insert(5);
          search.insert(15);
          search.insert(9);
          search.insert(3);
          search.insert(18);
//       search.TreeNode ret1= search.Find(10);
//         System.out.println(ret1.val);
            search.remove(10);
        search.TreeNode ret2= search.Find(10);
        if(ret2==null){
            return;
        }
    }
    public static void main1(String[] args) {
        int[] arrays={10,5,60,108,3,40};
        System.out.println("排序前"+ Arrays.toString(arrays));
        Sort.selectsort(arrays);
        System.out.println("排序后"+ Arrays.toString(arrays));
    }
}
